Construction of a New Domain Decomposition Method for the Stokes Equations
نویسندگان
چکیده
We propose a new domain decomposition method for the Stokes equations in two and three dimensions. The algorithm, we propose, is very similar to an algorithm which is obtained by a Richardson iteration of the Schur complement equation using a Neumann-Neumann preconditioner. A comparison of both methods with the help of a Fourier analysis shows clearly the advantage of the new approach. This could also be validated by numerical experiments.
منابع مشابه
Deriving a new domain decomposition method for the Stokes equations using the Smith factorization
In this paper the Smith factorization is used systematically to derive a new domain decomposition method for the Stokes problem. In two dimensions the key idea is the transformation of the Stokes problem into a scalar bi-harmonic problem. We show, how a proposed domain decomposition method for the bi-harmonic problem leads to a domain decomposition method for the Stokes equations which inherits...
متن کاملRobust Two-Level Lower-Order Preconditioners for a Higher-Order Stokes Discretization with Highly Discontinuous Viscosities
The main goal of this paper is to present new robust and scalable preconditioned conjugate gradient algorithms for solving Stokes equations with large viscosities jumps across subregion interfaces and discretized on non-structured meshes. The proposed algorithms do not require the construction of a coarse mesh and avoid expensive communications between coarse and fine levels. The algorithms bel...
متن کاملNumerical assessment of two-level domain decomposition preconditioners for incompressible Stokes and elasticity equations
Solving the linear elasticity and Stokes equations by an optimal domain decomposition method derived algebraically involves the use of non standard interface conditions. The onelevel domain decomposition preconditioners are based on the solution of local problems. This has the undesired consequence that the results are not scalable, it means that the number of iterations needed to reach converg...
متن کاملIncompressible laminar flow computations by an upwind least-squares meshless method
In this paper, the laminar incompressible flow equations are solved by an upwind least-squares meshless method. Due to the difficulties in generating quality meshes, particularly in complex geometries, a meshless method is increasingly used as a new numerical tool. The meshless methods only use clouds of nodes to influence the domain of every node. Thus, they do not require the nodes to be conn...
متن کاملThe new implicit finite difference scheme for two-sided space-time fractional partial differential equation
Fractional order partial differential equations are generalizations of classical partial differential equations. Increasingly, these models are used in applications such as fluid flow, finance and others. In this paper we examine some practical numerical methods to solve a class of initial- boundary value fractional partial differential equations with variable coefficients on a finite domain. S...
متن کامل